Reconstructing Geometry from Its Latent Structures

نویسنده

  • Geoffrey Oxholm
چکیده

Reconstructing Geometry from Its Latent Structures Geoffrey Oxholm Ko Nishino, Ph.D. Our world is full of objects with complex shapes and structures. Through extensive experience, humans quickly develop an intuition about how objects are shaped, and what their material properties are simply by analyzing their appearance. We engage this intuitive understanding of geometry in nearly everything we do. It is not surprising then, that a careful treatment of geometry stands to give machines a powerful advantage in the many tasks of visual perception. To that end, this thesis focuses on geometry recovery in a wide range of real-world problems. First, we describe a new approach to image registration. We observe that the structure of the imaged subject becomes embedded in the image intensities. By minimizing the change in shape of these intensity structures we ensure a physically realizable deformation. We then describe a method for reassembling fragmented, thin-shelled objects from range-images of their fragments using only the geometric and photometric structure embedded in the boundary of each fragment. Third, we describe a method for recovering and representing the shape of a geometric texture (such as bark, or sandpaper) by studying the characteristic properties of texture—self similarity and scale variability. Finally, we describe two methods for recovering the 3D geometry and reflectance properties of an object from images taken under natural illumination. We note that the structure of the surrounding environment, modulated by the reflectance, becomes embedded in the appearance of the object giving strong clues about the object’s shape.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIZE AND GEOMETRY OPTIMIZATION OF TRUSSES USING TEACHING-LEARNING-BASED OPTIMIZATION

A novel optimization algorithm named teaching-learning-based optimization (TLBO) algorithm and its implementation procedure were presented in this paper. TLBO is a meta-heuristic method, which simulates the phenomenon in classes. TLBO has two phases: teacher phase and learner phase. Students learn from teachers in teacher phases and obtain knowledge by mutual learning in learner phase. The suit...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

Single View Reconstruction for Specific Curve Structures

This paper presents effective algorithms for reconstructing three-dimensional models of specific curve structures from single perspective view images. The proposed method begins with edge detection and filtering from photographs or paintings with fine perspective geometry. Feature lines and corner points are extracted by transferring detected edges to normal distance and normal angle space. Cur...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Reconstruction of Convex Bodies from Brightness Functions

Algorithms are given for reconstructing an approximation to an unknown convex body from finitely many values of its brightness function, the function giving the volumes of its projections onto hyperplanes. One of these algorithms constructs a convex polytope with less than a prescribed number of facets, while the others do not restrict the number of facets. Convergence of the polytopes to the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014